Convergence and Efficiency of Adaptive Importance Sampling Techniques with Partial Biasing
نویسندگان
چکیده
منابع مشابه
A Scheme for Adaptive Biasing in Importance Sampling
This paper considers rare event simulation of large networks. Typical quantities of interest are system failure, blocking or cell loss probability, which are dependent on observations of rare events. For evaluation of such systems, previous work has shown that simulation with a speed-up technique called importance sampling is an efficient means, provided that a good biasing of the simulation pa...
متن کاملUniform Convergence of Sample Average Approximation with Adaptive Importance Sampling
We study sample average approximations under adaptive importance sampling. Based on a Banach-space-valued martingale strong law of large numbers, we establish uniform convergence of the sample average approximation to the function being approximated. In the optimization context, we obtain convergence of the optimal value and optimal solutions of the sample average approximation.
متن کاملConvergence of adaptive mixtures of importance sampling schemes
In the design of efficient simulation algorithms, one is often beset with a poor choice of proposal distributions. Although the performances of a given simulation kernel can clarify a posteriori how adequate this kernel is for the problem at hand, a permanent on-line modification of kernels causes concerns about the validity of the resulting algorithm. While the issue is most often intractable ...
متن کاملLayered Adaptive Importance Sampling
Monte Carlo methods represent the de facto standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities for drawing candidate samples. Performance of any such method is strictly related to the specification of the proposal ...
متن کاملSafe Adaptive Importance Sampling
Importance sampling has become an indispensable strategy to speed up optimization algorithms for large-scale applications. Improved adaptive variants—using importance values defined by the complete gradient information which changes during optimization—enjoy favorable theoretical properties, but are typically computationally infeasible. In this paper we propose an efficient approximation of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2018
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-018-1992-2